منابع مشابه
Gasoline: a flexible, parallel implementation of TreeSPH
The key features of the Gasoline code for parallel hydrodynamics with self-gravity are described. Gasoline is an extension of the efficient Pkdgrav parallel N-body code using smoothed particle hydrodynamics. Accuracy measurements, performance analysis and tests of the code are presented. Recent successful Gasoline applications are summarized. These cover a diverse set of areas in astrophysics i...
متن کاملCosmological Simulations with Treesph
We describe numerical methods for incorporating gas dynamics into cosmological simulations and present illustrative applications to the cold dark matter (CDM) scenario. Our evolution code, a version of TreeSPH (Hernquist & Katz 1989) generalized to handle comoving coordinates and periodic boundary conditions, combines smoothed{particle hydrodynamics (SPH) with the hierarchical tree method for c...
متن کاملAgeing Orders of Series-Parallel and Parallel-Series Systems with Independent Subsystems Consisting of Dependent Components
In this paper, we consider series-parallel and parallel-series systems with independent subsystems consisting of dependent homogeneous components whose joint lifetimes are modeled by an Archimedean copula. Then, by considering two such systems with different numbers of components within each subsystem, we establish hazard rate and reversed hazard rate orderings between the two system lifetimes,...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Astronomy
سال: 1997
ISSN: 1384-1076
DOI: 10.1016/s1384-1076(97)00019-5